Asymptotic distribution theory for Hoare's selection algorithm
ثبت نشده
چکیده
منابع مشابه
Combinatorial aspects of C.A.R. Hoare's FIND algorithm
In his invited address to the 1971 IFIP Congress, Donald E: Knuth [1] examined the average performance of C.A.R. Hoare's FIND algorithm [2] for finding the j-th largest out of n elements. Knuth commented that the recurrence relation that he derived was "not the kind of recurrence that we would normally expect to solve". Nevertheless, he went on to solve it, commenting on the "extra.ordinary coi...
متن کاملOn the median-of-K version of Hoare's selection algorithm
In Hoare’s (1961) original version of the algorithm Find the partitioning element in the central divide-and-conquer step is chosen uniformly at random from the set S in question. Here we consider a variant where this element is the median of a sample of size 2k + 1 from S. We investigate convergence in distribution of the number of comparisons required and obtain a simple explicit result for th...
متن کاملAsymptotic Optimality of Empirical Likelihood for Selecting Moment Restrictions
This paper proposes large deviation optimal properties of the empirical likelihood testing (ELT) moment selection procedures for moment restriction models. Since the parameter spaces of the moment selection problem is discrete, the conventional Pitman-type local alternative approach is not very helpful. By applying the theory of large deviations, we analyze convergence rates of the error probab...
متن کاملIntroducing a New Lifetime Distribution of Power Series Distribution of the Family Gampertz
In this Paper, We propose a new three-parameter lifetime of Power Series distributions of the Family Gampertz with decreasing, increasing, increasing-decreasing and unimodal Shape failure rate. The distribution is a Compound version of of the Gampertz and Zero-truncated Possion distributions, called the Gampertz-Possion distribution (GPD). The density function, the hazard rate function, a gener...
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003